Stone space partitions indexed by a poset

نویسندگان

چکیده

Stone space partitions $$\{X_{p}\mid p\in P\}$$ satisfying conditions like $$\overline{X_{p}}=\bigcup _{q\leqslant p}X_{q}$$ for all $$p\in P$$ , where P is a poset or PO system (poset with distinguished subset), arise naturally in the study both of primitive Boolean algebras and $$\omega $$ -categorical structures. A key concept studying such that p-trim open set which meets precisely those $$X_{q}$$ $$q\geqslant p$$ ; spaces, this topological equivalent pseudo-indecomposable set. This paper develops theory infinite spaces indexed by trim sets form neighbourhood base topology. We interplay between order properties poset/PO partition, examine extensions completions partitions, derive necessary sufficient on existence various types partition studied. also identify circumstances second countable given unique up to homeomorphism, subject choices isolated point structure boundedness elements. One corollary our results there $$\{X_{r}\mid r\in [0,1]\}$$ Cantor $$\overline{X_{r}}=\bigcup _{s\leqslant r}X_{s}\text { }r\in [0,1]$$ .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A poset structure on quasifibonacci partitions

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between these posets. Finally, we prove a strong generalization of Robbins’ result on the coefficients of a quasifibonacci power series.

متن کامل

Permutations Statistics of Indexed and Poset Permutations by Einar Steingrimsson

The definitions of descents and excedances in the elements of the symmetric group Sd are generalized in two different directions. First, descents and excedances are defined for indexed permutations, i.e. the elements of the group Sd = Zn I Sd, where is wreath product with respect to the usual action of Sd by permutation of [d]. It is shown, bijectively, that excedances and descents are equidist...

متن کامل

Linear extensions and order-preserving poset partitions

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving partitions) of a finite n-element poset P with n ≥ 3 is homotopy equivalent to a wedge of spheres of dimension n − 3. If P is connected, then the number of spheres is...

متن کامل

Edges in the poset of partitions of an integer

The edges in the Hasse diagram of the partitions of an integer ordered by reverse refinement are studied. A recursive count of the edges between ranks is developed. Let P, be the poset of partitions of n, ordered by refinement. It contains p(n; n-t) elements of rank t, where p(n; k) denotes the number of partitions of n into h-parts, p(n) will denote the number of partitions of n. The number NE...

متن کامل

On the poset of partitions of an integer

We study the posets (partially ordered sets) P, of partitions of an integer n, ordered by refinement, as defined by G. Birkhoff, “Lattice Theory” (3rd ed.) Colloq. Pub]. Vol. 25, 1967, Amer. Math. Sot. Providence. R.I. In particular we disprove the conjecture that the posets P,, are Cohen-Macaulay for all n. and show that even the Mobius function on the intervals does not alternate in sign in g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra Universalis

سال: 2023

ISSN: ['0002-5240', '1420-8911']

DOI: https://doi.org/10.1007/s00012-023-00816-6